منابع مشابه
Cellular Automata: Elementary Cellular Automata
Cellular automata (CA) are discrete dynamical systems consist of a regular finite grid of cell; each cell encapsulating an equal portion of the state, and arranged spatially in a regular fashion to form an n-dimensional lattice. A cellular automata is like computers, data represented by initial configurations which is processed by time evolution to produce output. This paper is an empirical stu...
متن کاملOn Quantum Cellular Automata
In recent work [1] by Schumacher and Werner was discussed an abstract algebraic approach to a model of reversible quantum cellular automata (CA) on a lattice. It was used special model of CA based on partitioning scheme and so there is a question about quantum CA derived from more general, standard model of classical CA. In present work is considered an approach to definition of a scheme with “...
متن کاملOn Cellular Automata Training
This article introduces multiprocessor scheduling algorithms based upon cellular automata. To design cellular automata corresponding to a given program graph a generic definition of program graph neighborhood is used, transparent to the various kinds, sizes and shapes of program graphs. The cellular automata-based scheduler works in two modes. In learning mode a genetic algorithm (GA) is applie...
متن کاملOn Quantum Cellular Automata
In recent work [1] by Schumacher and Werner was discussed an abstract algebraic approach to a model of reversible quantum cellular automata (CA) on a lattice. It was used special model of CA based on partitioning scheme and so there is a question about quantum CA derived from more general, standard model of classical CA. In present work is considered an approach to definition of a scheme with “...
متن کاملAlternation on Cellular Automata
In this paper we consider several notions of alternation in cellular automata: non-uniform, uniform and weak alternation. We study relations among these notions and with alternating Turing machines. It is proved that the languages accepted in polynomial time by alternating Turing machines are those accepted by alternating cellular automata in polynomial time for all the proposed alternating cel...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Nuclear Physics B - Proceedings Supplements
سال: 1996
ISSN: 0920-5632
DOI: 10.1016/0920-5632(96)00191-0